The Promise Polynomial Hierarchy

نویسندگان

  • Adam Chalcraft
  • Samuel Kutin
  • David Petrie Moulton
چکیده

The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise polynomial hierarchy is considerably simpler to work with, and many open questions about the polynomial hierarchy can be resolved in the promise polynomial hierarchy. Goldreich [3] argues that promise problems are a more natural object of study than non-promise problems, and our results would seem to confirm this. Our main theorem is that, in the world of promise problems, if φ ∝ T SAT then φ ∝ UVAL 2 , where UVAL 2 (f) is the promise problem of finding the unique x such that ∀y, f (x, y) = 1. We also give a complete promise problem for the promise problem equivalent of UP ∩ coUP, and prove the promise problem equivalents of P UP ∩ coUP = P UP and BPP UP ∩ coUP = BPP NP. Analagous results are known for NP and coNP [1]. as the most important, so (0, 1) < (1, 0). We write Σ * = ∞ n=1 Σ n for the set of finite strings from Σ. We write P + Σ = {{0}, {1}, Σ} for the set of non-empty subsets of Σ. We define ¬ : P + Σ → P + Σ by ¬{0} = {1}, ¬{1} = {0} and ¬Σ = Σ. 1.2. Promise problems. We extend the usual definition of a problem to a promise problem. Promise problems were first introduced by Even, Selman and Yacobi [1]. The concept of a promise problem encompasses two generalizations of a problem simultaneously. Firstly, a promise problem comes with a promise which we may assume is satisfied; if the promise is not satisfied, then either answer is valid. Secondly , a promise problem allows for more than one valid answer to a problem. Our approach is to reduce non-promise problems to promise problems and then work exclusively with promise problems in the sequel. A problem (or, for emphasis, a non-promise problem) is a function φ : Σ * → Σ. A function σ : Σ * → Σ solves φ when σ = φ. Let Φ be the set of all non-promise problems. A promise problem is a function φ : Σ * → P + Σ. A function σ : Σ …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Languages with Efficient Zero-Knowledge PCPs are in SZK

A Zero-Knowledge PCP (ZK-PCP) is a randomized PCP such that the view of any (perhaps cheating) efficient verifier can be efficiently simulated up to small statistical distance. Kilian, Petrank, and Tardos (STOC ’97) constructed ZK-PCPs for all languages in NEXP. Ishai, Mahmoody, and Sahai (TCC ’12), motivated by cryptographic applications, revisited the possibility of efficient ZK-PCPs for all ...

متن کامل

On the probabilistic closure of the loose unambiguous hierarchy

Unambiguous hierarchies [NR93, LR94, NR98] are defined similarly to the polynomial hierarchy; however, all witnesses must be unique. These hierarchies have subtle differences in the mode of using oracles. We consider a “loose” unambiguous hierarchy prUH• with relaxed definition of oracle access to promise problems. Namely, we allow to make queries that miss the promise set; however, the oracle ...

متن کامل

Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets

It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any complexity class closed under intersection; in particular, they thus hold for unambiguous polynomial time (UP). In contrast to the NP case, we prove that the Hausdorf...

متن کامل

ar X iv : c s . C C / 0 70 20 47 v 1 8 Fe b 20 07 Hierarchical Unambiguity ∗

We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and Promise-UP) to new constructs involving arbitrary higher levels of the relativized unambiguous polynomial hierarchy (UPH). Our techniques are developed on constraints imposed by hierarchic...

متن کامل

On the Complexity of Succinct Zero-Sum Games (Preliminary Version)

We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We complement the known EXP-hardness of computing the exact value of a succinct zero-sum game by several results on approximating the value. (1) We prove that approximating the value of a succinct zero-sum game to within an add...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1305.5561  شماره 

صفحات  -

تاریخ انتشار 2013